Orienting Triangulations
نویسندگان
چکیده
We show that the edges of any triangulation of a closed surface different from the projective plane and the sphere can be oriented such that every vertex has non-zero outdegree divisble by three. This confirms a conjecture of Barát and Thomassen.
منابع مشابه
Layered - Triangulations of 3 – Manifolds
A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...
متن کاملGeometric triangulations and discrete Laplacians on manifolds
2 Euclidean structures 3 2.1 Basic definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Weighted triangulations . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Thurston triangulations . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Duality triangulations . . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 Equivalence of metric triangulations . . . . . . . . . . . . ...
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملCounting triangulations and pseudo-triangulations of wheels
Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...
متن کاملNew bijective links on planar maps via orientations
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific “transversal structures” on triangulations of the 4-gon with no separating 3-cycle, which are called irreducible triangulations. This bijection specializes to a bijection between rooted non-separable maps and rooted irreducible triangulations. This yi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 83 شماره
صفحات -
تاریخ انتشار 2016